On the intersection conjecture for infinite trees of matroids
نویسندگان
چکیده
Using a new technique, we prove a rich family of special cases of the matroid intersection conjecture. Roughly, we prove the conjecture for pairs of tame matroids which have a common decomposition by 2-separations into finite parts.
منابع مشابه
On the intersection of infinite matroids
We show that the infinite matroid intersection conjecture of NashWilliams implies the infinite Menger theorem proved recently by Aharoni and Berger. We prove that this conjecture is true whenever one matroid is nearly finitary and the second is the dual of a nearly finitary matroid, where the nearly finitary matroids form a superclass of the finitary matroids. In particular, this proves the inf...
متن کاملMatroids with an infinite circuit-cocircuit intersection
We construct some matroids that have a circuit and a cocircuit with infinite intersection. This answers a question of Bruhn, Diestel, Kriesell, Pendavingh and Wollan. It further shows that the axiom system for matroids proposed by Dress does not axiomatize all infinite matroids. We show that one of the matroids we define is a thin sums matroid whose dual isn’t a thin sums matroid.
متن کاملOn the Circuit-cocircuit Intersection Conjecture
Oxley has conjectured that for k ≥ 4, if a matroidM has a k-element set that is the intersection of a circuit and a cocircuit, thenM has a (k− 2)-element set that is the intersection of a circuit and a cocircuit. In this paper we prove a stronger version of this conjecture for regular matroids. We also show that the stronger result does not hold for binary matroids.
متن کاملThe Intersection of a Matroid and a Simplicial Complex
A classical theorem of Edmonds provides a min-max formula relating the maximal size of a set in the intersection of two matroids to a “covering” parameter. We generalize this theorem, replacing one of the matroids by a general simplicial complex. One application is a solution of the case r = 3 of a matroidal version of Ryser’s conjecture. Another is an upper bound on the minimal number of sets ...
متن کاملMatroid intersection, base packing and base covering for infinite matroids
As part of the recent developments in infinite matroid theory, there have been a number of conjectures about how standard theorems of finite matroid theory might extend to the infinite setting. These include base packing, base covering, and matroid intersection and union. We show that several of these conjectures are equivalent, so that each gives a perspective on the same central problem of in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014